Improved lower bounds on the degree–diameter problem
نویسندگان
چکیده
منابع مشابه
Improved upper and lower bounds for the point placement problem
The point placement problem is to determine the positions of a set of n distinct points, P = {p1, p2, p3, . . . , pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (ppg), whose vertex set is P . The uniqueness requirement of the placemen...
متن کاملImproved lower bounds for solving the minimal open stacks problem
In this paper we demonstrate the benefit of calculating good lower bounds for the value of M , the maximum number of concurrently open stacks, for an optimal solution. We give several theoretical results and illustrate their use when applying a model checking approach to find solutions. The improvement afforded is equally valid when a constraints modelling approach is taken.
متن کاملImproved lower bounds for the online bin stretching problem
We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem. We also present a lower bound, wit...
متن کاملLower bounds on the Münchhausen problem
“The Baron’s omni-sequence”, B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with distinct integer weights between 1 gram and n grams. A trivial lower bound on B(n) is log3 n, and it has been shown that B(n) is log3 n + O(log log n). In thi...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2018
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-018-0822-6